Inductive versus Recursive Partitioning of Progress Graphs
نویسندگان
چکیده
In this paper we consider two-dimensional progress graphs and compare the complexity of the reduced state transition systems obtained by two different partitioning heuristics based on dihomotopy. We show experimentally that a recursive reduction algorithm could improve the results of Goubault et al.
منابع مشابه
Predicting Implantation Outcome of In Vitro Fertilization and Intracytoplasmic Sperm Injection Using Data Mining Techniques
Objective The main purpose of this article is to choose the best predictive model for IVF/ICSI classification and to calculate the probability of IVF/ICSI success for each couple using Artificial intelligence. Also, we aimed to find the most effective factors for prediction of ART success in infertile couples. MaterialsAndMethods In this cross-sectional study, the data of 486 patients are colle...
متن کاملUnder Consideration for Publication in J. Functional Programming Inductive Graphs and Functional Graph Algorithms
We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively deened data types. We show how this graph model can be implemented eeciently, and then we demonstrate how graph algorithms can be succinctly given by recursive function deenitions based on the inductive graph view. We also regard this as a contribution to the...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملParallel Incremental Graph Partitioning
Partitioning graphs into equally large groups of nodes while minimizing the number of edges between di erent groups is an extremely important problem in parallel computing. For instance, e ciently parallelizing several scienti c and engineering applications requires the partitioning of data or tasks among processors such that the computational load on each node is roughly the same, while commun...
متن کاملLearning Via Queries in [+, <]
We prove that the set of all recursive functions cannot be inferred using rst-order queries in the query language containing extra symbols +; <]. The proof of this theorem involves a new decidability result about Presburger arithmetic which is of independent interest. Using our machinery, we show that the set of all primitive recursive functions cannot be inferred with a bounded number of mind ...
متن کامل